SHA-3: The BLAKE Hash Function
نویسنده
چکیده
A global competition is currently taking place to select a hash function which will become a new standard in the field of cryptography. The competition was announced in 2007 by the National Institute of Standards and Technology (NIST) to find a successor to its previous Secure Hash Algorithm (SHA) standards, SHA-1 and SHA-2. The submissions have been narrowed down to a set of five, judged by their cryptographic security, speed, design features, and practical considerations. One of these five finalists is the BLAKE hash function, developed by a team based in Switzerland. This document will describe the function in detail, assess its qualities and strengths, and give insight into its implementation and performance. In 2012, the BLAKE algorithm may be selected by NIST to be published as the new SHA-3 standard.
منابع مشابه
Implementation of Blake Algorithm Using Pipelining in Fpga
This paper proposes the Pipelined SHA-3 BLAKE algorithm, running on an FPGA with the intention of developing the optimization in FPGA for BLAKE algorithm. Secured hash algorithm-3(SHA-3) BLAKE algorithm is a family of cryptographic hash function published by the National Institute of Standards and Technology (NIST). To implement BLAKE algorithm we have utilized VHDL, where we introduce the pipe...
متن کاملIndifferentiability of the Hash Algorithm BLAKE
The hash algorithm BLAKE, one of the SHA-3 finalists, was designed by Aumasson, Henzen, Meier, and Phan. Unlike other SHA-3 finalists, there is no known indifferentiable security proof on BLAKE. In this paper, we provide the indifferentiable security proof on BLAKE with the bound O( σ 2 2n−3 ), where σ is the total number of blocks of queries, and n is the hash output size.
متن کاملCompact Hardware Implementations of the SHA-3 Candidates ARIRANG, BLAKE, Gröstl, and Skein
The weakening of the widely used SHA-1 hash function has also cast doubts on the strength of the related algorithms of the SHA-2 family. The US NIST has therefore initiated the SHA-3 competition in order to select a modern hash function algorithm as a “backup” for SHA-2. This algorithm should be efficiently implementable both in software and hardware under different constraints. In this paper, ...
متن کاملCollisions for variants of the BLAKE hash function
In this paper we present an attack to the BLOKE and BRAKE hash functions, which are weakened versions of the SHA-3 candidate BLAKE. In difference to BLAKE, the BLOKE hash function does not permute the message words and constants in the round computation of the compression function, and BRAKE additionally removes feedforward and zeroes the constants used in each round of the compression function...
متن کاملAnalysis of BLAKE2
We present a thorough security analysis of the hash function family BLAKE2, a recently proposed and already in use tweaked version of the SHA-3 finalist BLAKE. We study how existing attacks on BLAKE apply to BLAKE2 and to what extent the modifications impact the attacks. We design and run two improved searches for (impossible) differential attacks — the outcomes suggest higher number of attacke...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011